A Disjointness Theorem Involving Topological Entropy
نویسندگان
چکیده
— A cover of some compact set X by two non dense open sets is called a standard cover. In the cartesian square of a flow (X, T ), pairs (x, x′) outside the diagonal are defined as entropy pairs whenever any standard cover (U, V ) such that (x, x′) ∈ Int(Uc) × Int(V c) has positive entropy. The set of such pairs is nonempty provided h(X, T ) > 0 ; it is T × T -invariant, and all pairs in its closure belong either to it or to the diagonal. A flow is said to have uniform positive entropy if any standard cover has positive entropy (or if all non diagonal pairs are entropy pairs). Properties of entropy pairs are used to show that flows with uniform positive entropy (in fact a wider class) are disjoint from minimal flows with entropy 0. A flow with uniform positive entropy containing only one periodic orbit is constructed. (*) Texte reçu le 10 mars 1992. F. BLANCHARD, Laboratoire de Mathématiques Discrètes, case 930, 163 av. de Luminy, 13288 Marseille Cedex 09 (France). e-mail : [email protected]. AMS classification : 54H20. BULLETIN DE LA SOCIÉTÉ MATHÉMATIQUE DE FRANCE 0037–9484/1993/465/$ 5.00 c © Société mathématique de France
منابع مشابه
On the Interplay between Measurable and Topological Dynamics E. Glasner and B. Weiss
Part 1. Analogies 3 1. Poincaré recurrence vs. Birkhoff’s recurrence 3 1.1. Poincaré recurrence theorem and topological recurrence 3 1.2. The existence of Borel cross-sections 4 1.3. Recurrence sequences and Poincaré sequences 5 2. The equivalence of weak mixing and continuous spectrum 7 3. Disjointness: measure vs. topological 10 4. Mild mixing: measure vs. topological 12 5. Distal systems: to...
متن کاملOn the Interplay between Measurable and Topological Dynamics
Part 1. Analogies 3 1. Poincaré recurrence vs. Birkhoff’s recurrence 3 1.1. Poincaré recurrence theorem and topological recurrence 3 1.2. The existence of Borel cross-sections 4 1.3. Recurrence sequences and Poincaré sequences 5 2. The equivalence of weak mixing and continuous spectrum 7 3. Disjointness: measure vs. topological 10 4. Mild mixing: measure vs. topological 12 5. Distal systems: to...
متن کاملEntropy Estimate for Maps on Forests
A 1993 result of J. Llibre, and M. Misiurewicz, (Theorem A [5]), states that if a continuous map f of a graph into itself has an s-horseshoe, then the topological entropy of f is greater than or equal to logs, that is h( f ) ? logs. Also a 1980 result of L.S. Block, J. Guckenheimer, M. Misiurewicz and L.S. Young (Lemma 1.5 [3]) states that if G is an A-graph of f then h(G) ? h( f ). In this pap...
متن کاملEntropy Theory without Past
This paper treats the Pinsker algebra of a dynamical system in a way which avoids the use of an ordering on the acting group. This enables us to prove some of the classical results about entropy and the Pinsker algebra in the general setup of measure preserving dynamical systems, where the acting group is a discrete countable amenable group. We prove a basic disjointness theorem which asserts t...
متن کاملRigorous Bounds on the Fast Dynamogrowth Rate Involving Topologicalentropyi
The fast dynamo growth rate for a C k+1 map or ow is bounded above by topo-logical entropy plus a 1=k correction. The proof uses techniques of random maps combined with a result of Yomdin relating curve growth to topological entropy. This upper bound implies the following anti-dynamo theorem: in C 1 systems fast dynamo action is not possible without the presence of chaos. In addition topologica...
متن کامل